Column Generation Based Heuristic for the Generalized Assignment Problem
نویسندگان
چکیده
This paper proposes a column generation based heuristic suitable for large and hard instances of the generalized assignment problem. First, just to be able to obtain the convergence of the column generation is reasonable times, it uses a sophisticated “triple” dual stabilization, combining piecewise linear penalty functions, Wentges’ dual smoothing and sub-gradient directional smoothing. In order to obtain integer good feasible solutions, a diversified diving heuristic is proposed. The overall method have found new best solutions for all open classic large-size instances of the generalized assignment problem.
منابع مشابه
Stabilized branch-and-cut-and-price for the generalized assignment problem
The Generalized Assignment Problem (GAP) is a classic scheduling problem with many applications. We propose a branch-and-cut-andprice for that problem featuring a stabilization mechanism to accelerate column generation convergence. We also propose ellipsoidal cuts, a new way of transforming the exact algorithm into a powerful heuristic, in the same spirit of the cuts recently proposed by Fische...
متن کاملFormulations and Solution Algorithms for a Dynamic Generalized Assignment Problem
This paper studies a Dynamic Generalized Assignment Problem (DGAP) which extends the well-known generalized assignment problem by considering a discretized time horizon and by associating a starting time and a finishing time with each task. Additional constraints related to warehouse and yard management applications are also considered. Two linear integer programming formulations of the problem...
متن کاملCrew Assignment via Constraint Programming: Integrating Column Generation and Heuristic Tree Search
The Airline Crew Assignment Problem (ACA) consists of assigning lines of work to a set of crew members such that a set of activities is partitioned and the costs for that assignment are minimized. Especially for European airline companies, complex constraints defining the feasibility of a line of work have to be respected. We developed two different algorithms to tackle the large scale optimiza...
متن کاملConstraint Programming Based Column Generation Heuristics for a Ship Routing and Berthing Time Assignment Problem
We develop a constraint programming based heuristic algorithm using column generation technique to solve a ship routing problem which the loading and unloading times of cargoes at pickup and drop-off locations are significant. In order to prevent congestions at the locations, we need to assign berthing time slots to each vessel to perform the loading and unloading tasks at different locations. ...
متن کاملAn Analytical Approach for Single and Mixed-Model Assembly Line Rebalancing and Worker Assignment Problem
In this paper, an analytical approach is used for assembly line rebalancing and worker assignment for single and mixed-model assembly lines based on a heuristic-simulation algorithm. This approach helps to managers to select a better marketing strategy when different combinations of demands are suitable.Furthermore, they can use it as a guideline to know which worker assignment is better for ea...
متن کامل